package com.wc.AlgoOJ._数学.超超大组合数;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/10/13 13:02
 * @description http://43.138.190.70:8888/p/MA0206
 */
public class Main {
    /**
     * 卢卡斯定理
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 10010, P = 10007;
    static long[] fact = new long[N], infact = new long[N];
    static long n, m;

    public static void main(String[] args) {
        fact[0] = infact[0] = 1;
        for (int i = 1; i < N; i++) {
            fact[i] = fact[i - 1] * i % P;
            infact[i] = qmi(fact[i], P - 2, P);
        }
        int T = sc.nextInt();
        while (T-- > 0) {
            n = sc.nextLong();
            m = sc.nextLong();
            out.println(Lucas(n, m));
        }
        out.flush();
    }

    static long Lucas(long n, long m) {
        if (n < P && m < P) return C(n, m);
        return Lucas(n / P, m / P) * C(n % P, m % P) % P;
    }

    static long C(long n, long m) {
        if (n < m) return 0;
        int x = (int) n, y = (int) m;
        return fact[x] * infact[x - y] % P * infact[y] % P;
    }

    static long qmi(long a, long b, long p) {
        long res = 1;
        while (b > 0) {
            if ((b & 1) == 1) res = res * a % p;
            a = a * a % p;
            b >>= 1;
        }
        return res;
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
